Pc { Matrices and the Linear Complementarity
نویسندگان
چکیده
We introduce a new matrix class Pc, which consists of those matrices M for which the solution set of the corresponding linear complementarity problem is connected for every q 2 I R n. We consider Lemke's pivotal method from the perspective of piecewise linear homotopies and normal maps and show that Lemke's method processes all matrices in Pc \Q0. We further investigate the relationship of the class Pc to other known matrix classes and show that column suucient matrices are a subclass of Pc, as are 2 2 P0{matrices.
منابع مشابه
An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
In this paper we describe a computational study of block principal pivoting (BP) and interior-point predictor-corrector (PC) algorithms for the solution of large-scale linear complementarity problems (LCP) with symmetric positive definite matrices. This study shows that these algorithms are in general quite appropriate for this type of LCPs. The BP algorithm does not seem to be sensitive to bad...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملP D - Matrices and Linear Complementarity Problems
Motivated by the definition of P†-matrix ([9]), another generalization of a P -matrix for square singular matrices called PD-matrix is proposed first. Then the uniqueness of solution of Linear Complementarity Problems for square singular matrices is proved using PD-matrices. Finally some results which are true for P -matrices are extended to PD-matrices.
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملNonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H−matrices
In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting methods for solving the linear complementarity problems with their coefficient matrices being H−matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.
متن کامل